A Combinatorial Property of the Full Transformation Semigroup
نویسنده
چکیده
Let c () be the collapse of full transformation semigroup, Tn. Then the general formula to calculate the number of collapsible elements, | tα-1| 2 is derived for all n 0, which is an extension of [1] (A.O. Adeniji and S.O. Makanjuola (2008), ‘On some combinatorial results of collapse and properties of height in full transformation semigroups,’ African Journal of Computing & ICT (Journal of the IEEE Nigeria Computer Chapter), Vol.1, No. 2, pp.61 – 63) .
منابع مشابه
On certain semigroups of transformations that preserve double direction equivalence
Let TX be the full transformation semigroups on the set X. For an equivalence E on X, let TE(X) = {α ∈ TX : ∀(x, y) ∈ E ⇔ (xα, yα) ∈ E}It is known that TE(X) is a subsemigroup of TX. In this paper, we discussthe Green's *-relations, certain *-ideal and certain Rees quotient semigroup for TE(X).
متن کاملCombinatorial Results for Semigroups of Orientation-Preserving Partial Transformations
Let Xn = {1, 2, . . . , n}. On a partial transformation α : Domα ⊆ Xn → Im α ⊆ Xn of Xn the following parameters are defined: the breadth or width of α is | Dom α |, the height of α is | Im α |, and the right (resp., left) waist of α is max(Im α) (resp., min(Im α)). We compute the cardinalities of some equivalences defined by equalities of these parameters on OPn, the semigroup of orientation-p...
متن کاملThe universal $mathcal{AIR}$- compactification of a semigroup
In this paper we establish a characterization of abelian compact Hausdorff semigroups with unique idempotent and ideal retraction property. We also introduce a function algebra on a semitopological semigroup whose associated semigroup compactification is universal withrespect to these properties.
متن کاملCombinatorial Deformations of the Full Transformation Semigroup
We define two deformations of the Full Transformation Semigroup algebra. One makes the algebra “as semisimple as possible”, while another leads to an eigenvalue result involving Schur functions. Preliminaries The Full Transformation Semigroup on n letters, denoted Tn, is the semigroup of all set maps w : [n] → [n], where [n] = {1, 2, . . . , n} and the multiplication is the usual composition. S...
متن کاملOn semigroups with PSPACE-complete subpower membership problem
Fix a finite semigroup S and let a1, . . . , ak , b be tuples in a direct power S. The subpower membership problem (SMP) for S asks whether b can be generated by a1, . . . , ak. For combinatorial Rees matrix semigroups we establish a dichotomy result: if the corresponding matrix is of a certain form, then the SMP is in P; otherwise it is NP-complete. For combinatorial Rees matrix semigroups wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011